Aplicações harmonicas e estabilidade em variedades bandeira

Orientador : Caio Jose Coleti NegreirosDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação CientificaResumo: Neste trabalho estudamos condições de estabilidade para os Referenciais de Frenet de aplicações Ø: M2 (F(n;~ds2?=(?ij) mostramos que os Referenciais de Frenet apesar de holomorfos~ não são estáveis relativamente a um conjunto de métricas de tipo Borel~ inclusive a métrica de Killing. Veremos antes alguns resultados de aplicações harmônicas; geometria complexa de F (n ): correspondência entre torneios e estrutura quase c-omplexa numa variedade bandeiraAbstract: In this work we study the stability conditions for Eells-MestradoMestre em Matemátic

Pareto optimality conditions and duality for vector quadratic fractional optimization problems

One of the most important optimality conditions to aid in solving a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient optimality conditions, it is necessary to impose additional assumptions on the objective functions and on the constraint set. The present work is concerned with the constrained vector quadratic fractional optimization problem. It shows that sufficient Pareto optimality conditions and the main duality theorems can be established without the assumption of generalized convexity in the objective functions, by considering some assumptions on a linear combination of Hessian matrices instead. The main aspect of this contribution is the development of Pareto optimality conditions based on a similar second-order sufficient condition for problems with convex constraints, without convexity assumptions on the objective functions. These conditions might be useful to determine termination criteria in the development of algorithms.Coordenação de aperfeiçoamento de pessoal de nivel superior (Brasil)Ministerio de Ciencia y TecnologíaConselho Nacional de Desenvolvimento Científico e Tecnológico (Brasil)Fundação de Amparo à Pesquisa do Estado de São Paul

A conjecture on a continuous optimization model for the Golomb Ruler Problem

A Golomb Ruler (GR) is a set of integer marks along an imaginary ruler such that all the distances of the marks are different. Computing a GR of minimum length is associated to many applications (from astronomy to information theory). Although not yet demonstrated to be NP-hard, the problem is computationally very challenging. This brief note proposes a new continuous optimization model for the problem and, based on a given theoretical result and some computational experiments, we conjecture that an optimal solution of this model is also a solution to an associated GR of minimum length

Unassigned distance geometry and molecular conformation problems

International audienc